//
// Source code recreated from a .class file by IntelliJ IDEA
// (powered by FernFlower decompiler)
//

package 力扣.题库.周赛.周赛446;

public class Q2 {
    public Q2() {
    }

    public int maximumPossibleSize(int[] nums) {
        int count = 1;
        int n = nums.length;
        int max = nums[0];

        for(int i = 1; i < n; ++i) {
            if (nums[i] >= max) {
                max = nums[i];
                ++count;
            }
        }

        return count;
    }
}
